منابع مشابه
Symbolic Dynamics and the Category of Graphs
Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as stochastic processes, automata, combinatorial group theory, C∗-algebras, etc. We put a Quillen model structure on the category of directed graphs, for which...
متن کاملRecursion Theory and Symbolic Dynamics
A set P ⊆ {0,1}N may be viewed as a mass problem, i.e., a decision problem with more than one solution. By definition, the solutions of P are the elements of P . A mass problem is said to be solvable if at least one of its solutions is recursive. A mass problem P is said to be Muchnik reducible to a mass problem Q if for each solution of Q there exists a solution of P which is Turing reducible ...
متن کاملAutomata Theory and Symbolic Dynamics Workshop
We consider the following question: what is the least biased stochastic process over the runs of a given timed automaton? By “least biased”, we mean the one that generates runs with a distribution which is closest to uniform (w.r.t. volume). To answer this question, we first define stochastic processes over runs of timed automata and their entropy, the definition of which is inspired by Shannon...
متن کاملA Theory of Symbolic Dynamics for Hybrid Systems
In this paper, we introduce a new semantics for hybrid systems called symbolic dynamics. The semantics is constructed in the tradition of denotational semantics of programming languages, which defines the meaning of a construct by a function. The novelty of this approach is that these semantic functions are defined on complex state spaces carrying algebraic and analytic structures. As in the de...
متن کاملCategory Theory
This article presents a development of Category Theory in Isabelle. A Category is defined using records and locales in Isabelle/HOL. Functors and Natural Transformations are also defined. The main result that has been formalized is that the Yoneda functor is a full and faithful embedding. We also formalize the completeness of many sorted monadic equational logic. Extensive use is made of the HO...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.023